Identification of genetic network dynamics with unate structure
نویسندگان
چکیده
منابع مشابه
of “ Identification of genetic network dynamics with unate structure ”
1 Algebraic form of kinetic models with unate structure In the main text, a kinetic model bi(x), with x = (x1, . . . , xn), is obtained from a Boolean expression Bi(X), with X = (X1, . . . , Xn), via the following substitutions. Each variable Xi is replaced by σ(xi). Given any two functions τ(x) and τ ′(x) representing the boolean expressions T (X) and T ′(X), we encode ¬T (X) by 1− τ(x) and T ...
متن کاملIdentification of genetic network dynamics with unate structure
MOTIVATION Modern experimental techniques for time course measurement of gene expression enable the identification of dynamical models of genetic regulatory networks. In general, identification involves fitting appropriate network structures and parameters to the data. For a given set of genes, exploring all possible network structures is clearly prohibitive. Modelling and identification method...
متن کاملIntelligent identification of vehicle’s dynamics based on local model network
This paper proposes an intelligent approach for dynamic identification of the vehicles. The proposed approach is based on the data-driven identification and uses a high-performance local model network (LMN) for estimation of the vehicle’s longitudinal velocity, lateral acceleration and yaw rate. The proposed LMN requires no pre-defined standard vehicle model and uses measurement data to identif...
متن کاملLearning the structure of genetic network dynamics: A geometric approach
This work concerns the identification of the structure of a genetic network model from measurements of gene product concentrations and synthesis rates. In earlier work, for a wide family of network models, we developed a data preprocessing algorithm that is able to reject many hypotheses on the network structure by testing certain monotonicity properties of the models. Here we develop a geometr...
متن کاملConjunctions of Unate DNF Formulas: Learning and Structure
A central topic in query learning is to determine which classes of Boolean formulas are e ciently learnable with membership and equivalence queries. We consider the class Rk consisting of conjunctions of k unate DNF formulas. This class generalizes the class of k-clause CNF formulas, and the class of unate DNF formulas, both of which are known to be learnable in polynomial time with membership ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2010
ISSN: 1460-2059,1367-4803
DOI: 10.1093/bioinformatics/btq120